Multirelational linguistic models
نویسنده
چکیده
This paper regards the recurrent linguistic rule bases. These systems are considered as relational models with several relations. Such representation allows to use relation algebra for analysis and design systems with desired transfer characteristics. The approach provides opportunities to apply linguistic models for investigation of the weak formalised processes.
منابع مشابه
New Applications on Linguistic Mathematical Structures and Stability Analysis of Linguistic Fuzzy Models
In this paper some algebraic structures for linguistic fuzzy models are defined for the first time. By definition linguistic fuzzy norm, stability of these systems can be considered. Two methods (normed-based & graphical-based) for stability analysis of linguist fuzzy systems will be presented. At the follow a new simple method for linguistic fuzzy numbers calculations is defined. At the end tw...
متن کاملMultirelational Active Learning for Games
The relational concepts and the need for pattern recognition required to formulate playing notions in games such as Go and Minesweeper make them an ideal testbed for multirelational learning. However, with the exception of chess, games have received little attention from the research community in multirelational learning. Mio, a covering example-driven multirelational learning system, has been ...
متن کاملA Multirelational Algebra for Multidatabase Systems
Interoperability of multiple databases is becoming an important issue in these years. Researchers have taken diierent approaches to integrate the autonomous database systems. These approaches can be roughly divided into the ones needing an integrated schema and those without the need of an integrated schema. In either case, an algebra of multidatabase level is important since it provides a math...
متن کاملSearch Improvements in Multirelational Learning
In this thesis we lay the foundations to develop multirelational learning systems which can cope better with the challenges posed by structural and topological domains. Even though many interesting application domains contain structural or topological data, current multirelational systems have difficulties dealing with the complexity of the search space of theses domains, their indeterminacy, a...
متن کاملMultirelational Consensus Clustering with Nonnegative Decompositions
Unsupervised multirelational learning (clustering) in non-sparse domains such as molecular biology is especially difficult as most clustering algorithms tend to produce distinct clusters in slightly different runs (either with different initializations or with slightly different training data). In this paper we develop a {\em multirelational consensus clustering\/} algorithm based on nonnegativ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003